Connection caching: model and algorithms
نویسندگان
چکیده
منابع مشابه
Connection Caching for WWW Servers and Proxies
This paper proposes connection caching to reduce the overhead of accessing WWW pages. Connection caching means that a WWW server or a WWW proxy server does not release its connection with a client or a peer but retains it and uses it again after the transmission is completed. The retained connection is cached and it is used for future access. Connection caching reduces network traffic and serve...
متن کاملCaching in Matrix Product Algorithms
A new type of diagram is introduced for visualizing matrix product states which makes transparent a connection between matrix product states and complex weighted finite state automata. It is then shown how one can proceed in the opposite direction: writing an automata that “generates” an operator gives one an immediate matrix factorization of it. Matrix product factorizations are shown to have ...
متن کاملAutomatic Generation of Caching Algorithms
Grammatical Evolution (GE) is a grammar based GA to generate computer programs which has been shown to be comparable with GP when applied to a diverse array of problems. GE has the distinction that its input is a BNF, which permits it to generate programs in any language, of arbitrary complexity, including loops, multiple line functions etc. Part of the power of GE is that it is closer to natur...
متن کاملAdaptive Web Proxy Caching Algorithms
Web proxy caching is a well-known technique for reducing access latencies and bandwidth consumption. As in other caching systems, a replacement policy is necessary for determining when and what to evict from the cache, and many proxy caching algorithms have been proposed and evaluated over the years. Yet many of these algorithms were motivated by the Internet traffic trends in place during the ...
متن کاملCaching Algorithms and Rational Models of Memory
People face a problem similar to that faced by algorithms that manage the memory of computers: trying to organize information to maximize the chance it will be available when needed in the future. In computer science, this problem is known as “caching”. Inspired by this analogy, we compared the properties of a model of human memory proposed by Anderson and Schooler (1991) and caching algorithms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2003
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(03)00041-2